Expert-driven trace clustering with instance-level constraints

نویسندگان

چکیده

Within the field of process mining, several different trace clustering approaches exist for partitioning traces or instances into similar groups. Typically, this is based on certain patterns similarity between traces, driven by discovery a model each cluster. The main drawback these techniques, however, that their solutions are usually hard to evaluate justify domain experts. In paper, we present two constrained techniques capable leverage expert knowledge in form instance-level constraints. an extensive experimental evaluation using real-life datasets, show our novel indeed producing more justifiable without substantial negative impact quality.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clustering with Instance-level Constraints

Clustering algorithms conduct a search through the space of possible organizations of a data set. In this paper, we propose two types of instance-level clustering constraints – must-link and cannot-link constraints – and show how they can be incorporated into a clustering algorithm to aid that search. For three of the four data sets tested, our results indicate that the incorporation of surpris...

متن کامل

SOM based clustering with instance-level constraints

This paper describes a new topological map dedicated to clustering under instance-level constraints. In general, traditional clustering is used in an unsupervised manner. However, in some cases, background information about the problem domain is available or imposed in the form of constraints, in addition to data instances. In this context, we modify the popular SOM algorithm to take these cons...

متن کامل

Clustering Trees with Instance Level Constraints

Constrained clustering investigates how to incorporate domain knowledge in the clustering process. The domain knowledge takes the form of constraints that must hold on the set of clusters. We consider instance level constraints, such as must-link and cannot-link. This type of constraints has been successfully used in popular clustering algorithms, such as k-means and hierarchical agglomerative ...

متن کامل

Instance-Level Constraints in Density-Based Clustering

Clustering data into meaningful groups is one of most important tasks of both artificial intelligence and data mining. In general, clustering methods are considered unsupervised. However, in recent years, so-named constraints become more popular as means of incorporating additional knowledge into clustering algorithms. Over the last years, a number of clustering algorithms employing different t...

متن کامل

A Survey of Clustering with Instance Level Constraints

Clustering with constraints is an important recent development in the clustering literature. The addition of constraints allows users to incorporate domain expertise into the clustering process by explicitly specifying what are desirable properties in a clustering solution. This is particularly useful for applications in domains where considerable domain expertise already exists. In this first ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Knowledge and Information Systems

سال: 2021

ISSN: ['0219-3116', '0219-1377']

DOI: https://doi.org/10.1007/s10115-021-01548-6